Complexity Analysis of Size-Change Terminating Programs
نویسندگان
چکیده
منابع مشابه
Termination Analysis of the Untyped λ-Calculus
An algorithm is developed that, given an untyped λ-expression, can certify that its call-by-value evaluation will terminate. It works by an extension of the “size-change principle” earlier applied to firstorder programs. The algorithm is sound (and proven so in this paper) but not complete: some λ-expressions may in fact terminate under callby-value evaluation, but not be recognised as terminat...
متن کاملCalculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and calculating other properties of programs, including their runtime, maximum stack depth, and (relative) path time costs. In this paper we show how precise (not just big-O) polynomial bounds on such costs may be calcula...
متن کاملQuasi-Termination Analysis of Logic Programs Using Size-Change Graphs
A logic program is quasi-terminating when only a finite number of different calls—up to variable renaming—are derivable from any given goal. Ensuring the quasi-termination of programs w.r.t. a class of goals is a relevant problem in several areas, like tabled evaluation or partial evaluation, where quasi-termination implies the full termination of the specialization process. In this work, we ad...
متن کاملImproving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
An offline approach to narrowing-driven partial evaluation (a partial evaluation scheme for first-order functional and functional logic programs) has recently been introduced. In this approach, program annotations (i.e., the expressions that should be generalized at partial evaluation time to ensure termination) are based on a simple syntactic characterization of quasi-terminating programs. Thi...
متن کاملQuasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound on the size of function outputs. In this former work, a criterion, which can be applied to terminating as well as non-terminating programs, was developed...
متن کامل